Non-Associative Structures in Homomorphic Encryption
نویسندگان
چکیده
In this paper, we obtain a classification of quasigroup rings by the quantity elements with null left annihilator for different quasigroups. This becomes possible due to criterion being an element in ring. By virtue criterion, make calculation find regularities using various fields and quasigroups order 4. outcome helps us two results where any have same number ring GF(p)Q fixed Q has GF(pn)Q.
منابع مشابه
Non-interactive Zero-Knowledge from Homomorphic Encryption
We propose a method for compiling a class of Σ-protocols (3-move public-coin protocols) into non-interactive zero-knowledge arguments. The method is based on homomorphic encryption and does not use random oracles. It only requires that a private/public key pair is set up for the verifier. The method applies to all known discrete-log based Σ-protocols. As applications, we obtain non-interactive ...
متن کاملHomomorphic Encryption
Fully homomorphic encryption (FHE) has been called the “Swiss Army knife of cryptography”, since it provides a single tool that can be uniformly applied to many cryptographic applications. In this tutorial we study FHE and describe its different properties, relations with other concepts in cryptography, and constructions. We briefly discuss the three generations of FHE constructions since Gentr...
متن کاملHomomorphic Encryption 4 : Construction of fully homomorphic encryption .
Assumption We’ll make the following “learning divisor with noise” assumption: LDN Assumption: let P a random n bit prime, R a random n4 bit prime, and let N = PR. A distinguisher that is given N and X1, . . . , Xpoly(n) cannot distinguish between case (I) Xi’s are chosen independently at random from [N ], and (II) Xi = PQi + 2Ei (mod N) where Qi is chosen independently at random from [R] and Ei...
متن کاملFaster Fully Homomorphic Encryption
We describe two improvements to Gentry's fully homomorphic scheme based on ideal lattices and its analysis: we provide a more aggressive analysis of one of the hardness assumptions (the one related to the Sparse Subset Sum Problem) and we introduce a probabilistic decryption algorithm that can be implemented with an algebraic circuit of low multiplicative degree. Combined together, these improv...
متن کاملSubring Homomorphic Encryption
In this paper, we construct subring homomorphic encryption scheme that is a homomorphic encryption scheme built on the decomposition ring, which is a subring of cyclotomic ring. In the scheme, each plaintext slot contains an integer in Zpl , rather than an element of GF(p) as in conventional homomorphic encryption schemes on cyclotomic rings. Our benchmark results indicate that the subring homo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Sciences
سال: 2022
ISSN: ['1072-3374', '1573-8795']
DOI: https://doi.org/10.1007/s10958-022-05850-8